Main Memory Implementations for Binary Grouping
نویسندگان
چکیده
An increasing number of applications depend on efficient storage and analysis features for XML data. Hence, query optimization and efficient evaluation techniques for the emerging XQuery standard become more and more important. Many XQuery queries require nested expressions. Unnesting them often introduces binary grouping. We introduce several algorithms implementing binary grouping and analyze their time and space complexity. Experiments demonstrate their performance.
منابع مشابه
Parallel Implementations of Perceptual Grouping Tasks on Distributed Memory Machines
(Summary of Results) Abstract In this paper, we propose parallel implementations for solving Perceptual Grouping tasks on distributed memory machines. Our implementations show that, given 7K line segments extracted from a 1K 1K image, the Line Grouping task can be performed in 0.486 seconds using a partition of CM-5 having 256 processing nodes and in 0.382 seconds using a 16-node Cray T3D. The ...
متن کاملMain-Memory Query Processing Utilizing External Indexes
Truong, T. 2016. Main-Memory Query Processing Utilizing External Indexes. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1352. 45 pp. Uppsala: Acta Universitatis Upsaliensis. ISBN 978-91-554-9509-1. Many applications require storage and indexing of new kinds of data in main-memory, e.g. color histograms, textures, shape features, gene sequenc...
متن کاملRealisation of a Dynamically Grouped Object-Oriented Virtual Memory Hierarchy
Conventional paging systems do not perform well with large object-oriented environments (such as Smalltalk-80 [GR83]) due to the fine granularity of objects and the persistence of the object space. One approach taken to increase efficiency has been to group objects together in virtual space in an attempt to keep related objects on the same page. Conventionally, grouping has been performed whils...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملGrouping and Duplicate Elimination: Beneets of Early Aggregation
Early aggregation is a technique for speeding up the processing of GROUP BY queries by reducing the amount of intermediate data transferred between main memory and disk. It can also be applied to duplicate elimination because duplicate elimination is equivalent to grouping with no aggregation functions. This paper describes six diierent algorithms for grouping and aggregation, shows how to inco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005